Green's function solution of the time-dependent solar collector problem
نویسندگان
چکیده
منابع مشابه
the problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولTHE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملSolution of the solar-neutrino problem.
The assumption that coulomb barrier tunneling in stars is a two-body process is incorrect. Tunneling is mediated by an electron passing between the particles as they collide. The presence of an electron lowers the potential barrier and increases the probability of tunneling by orders of magnitude. The solar luminosity can be maintained with a central temperature near 107K where the neutrino pro...
متن کاملSolution methods for the Time-Dependent Orienteering Problem
The orienteering problem (OP) is defined on a graph in which scores are assigned to the vertices and a travel time is assigned to each edge linking two vertices. The objective of the OP is to select a subset of vertices and determine the order in which they are visited so that the total collected score is maximized while the maximum total travel time is not exceeded. In addition, a feasible OP ...
متن کاملA fast solution method for the time-dependent orienteering problem
This paper introduces a fast solution procedure to solve 100-node instances of the time-dependent orienteering problem (TD-OP) within a few seconds of computation time. Orienteering problems occur in logistic situations were an optimal combination of locations needs to be selected and the routing between the selected locations needs to be optimized. In the time-dependent variant, the travel tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1984
ISSN: 0307-904X
DOI: 10.1016/0307-904x(84)90150-1